robabilistic Propositional Planning: Representations and Complexity
نویسنده
چکیده
Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superficial differences between the represent at ions, they are “expressively equivalent ,” meaning that planning problems specified in one representation can be converted to equivalent planning problems in any of the other representations with at most a polynomial factor increase in the size of the resulting representation and the number of steps needed to reach the goal with sufficient probability. The paper proves that the computational complexity of determining whether a successful plan exists for planning problems expressed in any of these representations is EXPTIME-complete and PSPACE-complete when plans are restricted to take a polynomial number of
منابع مشابه
Probabilistic Propositional Planning: Representations and Complexity
Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superrcial diierences between the representations , they are \expressively equivalent," meaning that planning problems speciied in one representation can be converted to equivalent planning problems in any of the other representati...
متن کاملEncoding Plans in Propositional Logic
In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings for STRIPS-style planning, which are sound and complete representations of the original STRIPS specificati...
متن کاملEfficient Representations for the Modal Logic S5
We investigate efficient representations of subjective formulas in the modal logic of knowledge, S5, and more generally of sets of sets of propositional assignments. One motivation for this study is contingent planning, for which many approaches use operations on such formulas, and can clearly take advantage of efficient representations. We study the language S5-DNF introduced by Bienvenu et al...
متن کاملPolynomial-Length Planning Spans the Polynomial Hierarchy (Incomplete Draft)
This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? Several classes of planning problems are considered: classical planning, conformant planning, conditional planning with full or partial observability. Throughout, attention is restricted to plans of polynomiallybounded length. For conditional plannin...
متن کاملA Note on Concurrency and Complexity in Temporal Planning
Rintanen recently reported (Rintanen 2007) that the complexity of temporal planning with durative actions of fixed durations in propositional domains depends on whether it is possible for multiple instances of the same action to execute concurrently. In this paper we explore the circumstances in which such a situation might arise and show that the issue is directly connected to previously estab...
متن کامل